High rank linear syzygies on low rank quadrics
نویسندگان
چکیده
منابع مشابه
High Rank Linear Syzygies on Low Rank Quadrics
We study the linear syzygies of a homogeneous ideal I ⊆ S = Symk(V ), focussing on the graded betti numbers bi,i+1 = dimk Tori(S/I, k)i+1. For a variety X and divisor D with V = H(D), what conditions on D ensure that bi,i+1 6= 0? In [2], Eisenbud shows that a decomposition D∼A+B such that A and B have at least two sections gives rise to determinantal equations (and corresponding syzygies) in IX...
متن کاملMonads and Rank Three Vector Bundles on Quadrics
In this paper we give the classification of rank 3 vector bundles without ”inner” cohomology on a quadric hypersurface Qn (n > 3) by studying the associated monads. Introduction A monad on P or, more generally, on a projective variety X, is a complex of three vector bundles 0 → A α −→ B β −→ C → 0 such that α is injective as a map of vector bundles and β is surjective. Monads have been studied ...
متن کاملLow Rank Matrix Approximation in Linear Time
Given a matrix M with n rows and d columns, and fixed k and ε, we present an algorithm that in linear time (i.e., O(N)) computes a k-rank matrix B with approximation error ‖M−B‖2F ≤ (1+ ε)μopt(M, k), where N = nd is the input size, and μopt(M, k) is the minimum error of a k-rank approximation to M. This algorithm succeeds with constant probability, and to our knowledge it is the first linear-ti...
متن کاملOn the Low Rank Solutions for Linear Matrix Inequalities
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was shown in AuYeung and Poon [1] and Barvinok [3]. In Au-Yeung and Poon’s approach, an earlier unpublished manuscript of Bohnenblust [6] played an essential role. Both proofs in [1] and [3] are nonconstructive in nature. Th...
متن کاملRank Determination for Low-Rank Data Completion
Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we aim to approximate the unknown rank based on the location of sampled entries and some given completion. We consider a number of data models, including singl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Mathematics
سال: 2012
ISSN: 1080-6377
DOI: 10.1353/ajm.2012.0012